منابع مشابه
Duality Theory for Interval Linear Programming Problems
We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...
متن کاملTwo classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes. © 2011 Elsevier B.V. All rights reserved.
متن کاملHigh Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a collection of adjoining surfaces, the constraints for all of the surfaces must be simultaneously satisfied. These constraints can be formulated as an integer linear program. Not all solutions to this problem are equally de...
متن کاملOptimization model for resource assignment problems of linear construction projects
For linear construction projects, it has long been known that resource utilization is i]mportant in improving work efficiency. However, most existing scheduling techniques cannot satisfy the need for solving such issues. This study presents a flexible model for resolving linear scheduling problems involving different objectives and resource assignment tasks. The proposed model adopts constraint...
متن کاملImproved Harmony Search with Chaos for Solving Linear Assignment Problems
This paper presents an improved version of a harmony meta-heuristic algorithm, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Nume rical results show that the IHSCH is able to obtain the optimal results in comparison with tradit ional methods (the Hungarian method). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Universal Journal of Applied Mathematics
سال: 2013
ISSN: 2331-6446,2331-6470
DOI: 10.13189/ujam.2013.010103